Regularized Least Square Regression with Spherical Polynomial Kernels
نویسنده
چکیده
This article considers regularized least square regression on the sphere. It develops a theoretical analysis of the generalization performances of regularized least square regression algorithm with spherical polynomial kernels. The explicit bounds are derived for the excess risk error. The learning rates depend on the eigenvalues of spherical polynomial integral operators and on the dimension of spherical polynomial spaces.
منابع مشابه
Reproducing Kernel Hilbert Spaces in Learning Theory: the Sphere and the Hypercube
We analyze the regularized least square algorithm in learning theory with Reproducing Kernel Hilbert Spaces (RKHS). Explicit convergence rates for the regression and binary classification problems are obtained in particular for the polynomial and Gaussian kernels on the n-dimensional sphere and the hypercube. There are two major ingredients in our approach: (i) a law of large numbers for Hilber...
متن کاملConvergence Rate of Coefficient Regularized Kernel-based Learning Algorithms
We investigate machine learning for the least square regression with data dependent hypothesis and coefficient regularization algorithms based on general kernels. We provide some estimates for the learning raters of both regression and classification when the hypothesis spaces are sample dependent. Under a weak condition on the kernels we derive learning error by estimating the rate of some K-f...
متن کاملCorrigendum: Regularized Least Squares Approximations on the Sphere Using Spherical Designs
Abstract. We consider polynomial approximation on the unit sphere S = {(x, y, z) ∈ R : x + y + z = 1} by a class of regularized discrete least squares methods, with novel choices for the regularization operator and the point sets of the discretization. We allow different kinds of rotationally invariant regularization operators, including the zero operator (in which case the approximation includ...
متن کاملRegression Modeling for Spherical Data via Non-parametric and Least Square Methods
Introduction Statistical analysis of the data on the Earth's surface was a favorite subject among many researchers. Such data can be related to animal's migration from a region to another position. Then, statistical modeling of their paths helps biological researchers to predict their movements and estimate the areas that are most likely to constitute the presence of the animals. From a geome...
متن کاملRegularized Least Square Regression with Unbounded and Dependent Sampling
and Applied Analysis 3 Theorem 4. Suppose that the unbounded hypothesis with p > 2 holds, L−r K f ρ ∈ L 2 ρX (X) for some r > 0, and theα-mixing coefficients satisfy a polynomial decay, that is, α l ≤ bl −t for some b > 0 and t > 0. Then, for any 0 < η < 1, one has with confidence 1 − η, fz,γ − ρ ρX = O(m −θmin{(p−2)t/p,1} (logm)1/2) , (13) where θ is given by θ = { { { { { {...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJWMIP
دوره 7 شماره
صفحات -
تاریخ انتشار 2009